The split delivery vehicle scheduling problem with time windows and grid network distances

We consider an extension o f the Split Delivery Vehicle R outing Problem , whereby custom ers may have a tim e window on their delivery. A construction heuristic is developed which uses a look-ahead approach to solve the Split Delivery Vehicle Scheduling Problem with T im e W indow s. T w o im provem ent heuristics are also given: one attem pts to m ove custom ers between routes, while the other exchanges custom ers from one route to another. All three heuristics are im plem ented on a specifically developed data set and on som e standard problems from the literature. Our heuristics also consider th e possibility o f m ultiple tim e windows, grid network distances, non-linear delivery tim es and bounds on the size o f any split deliveries.